Phylogenetic Diversity and the Greedy Algorithm
نویسندگان
چکیده
منابع مشابه
Phylogenetic diversity and the greedy algorithm.
Given a phylogenetic tree with leaves labeled by a collection of species, and with weighted edges, the "phylogenetic diversity" of any subset of the species is the sum of the edge weights of the minimal subtree connecting the species. This measure is relevant in biodiversity conservation where one may wish to compare different subsets of species according to how much evolutionary variation they...
متن کاملMaximizing phylogenetic diversity in biodiversity conservation: Greedy solutions to the Noah's Ark problem.
The Noah's Ark Problem (NAP) is a comprehensive cost-effectiveness methodology for biodiversity conservation that was introduced by Weitzman (1998) and utilizes the phylogenetic tree containing the taxa of interest to assess biodiversity. Given a set of taxa, each of which has a particular survival probability that can be increased at some cost, the NAP seeks to allocate limited funds to conser...
متن کاملMitochondrial Diversity and Phylogenetic Structure of Marghoz Goat Population
The genetic diversity and phylogenetic structure was analyzed in Marghoz goat population by mitochondrial DNA sequences. Phylogenetic analysis was carried out using hyper variable region 1 (968 bp) obtained form 40 animals. Marghoz goat proved to be extremely diverse (average haplotype diversity of 0.999) and the nucleotide diversity values 0.022. A total of 40 Marghoz goats were grouped into s...
متن کاملphylogeography and genetic diversity of the lesser mouse- eared bat (myotis blythii) in iran
in current study, 63 samples of bat populations collected from differ regions were used for evaluating the geographic variations. twenty cranial and dental characters for traditional morphometric and landmarks method on the ventral, dorsal skull and mandible for geometry morphometric studies were used. statistical analyses of traditional morphometric and geometry morphometric data indicated low...
Evaluating the Reverse Greedy Algorithm
This paper present two meta heuristics, reverse greedy and future aware greedy, which are variants of the greedy algorithm. Both are based on the observation that guessing the impact of future selections is useful for the current selection. While the greedy algorithm makes the best local selection given the past, future aware greedy makes the best local selection given the past and the estimate...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Systematic Biology
سال: 2005
ISSN: 1076-836X,1063-5157
DOI: 10.1080/10635150590947023